Self-Embeddings of Computable Trees
نویسندگان
چکیده
We divide the class of infinite computable trees into three types. For the first and second types, 0 computes a nontrivial self-embedding while for the third type 0 computes a nontrivial self-embedding. These results are optimal and we obtain partial results concerning the complexity of nontrivial selfembeddings of infinite computable trees considered up to isomorphism. We show that every infinite computable tree must have either an infinite computable chain or an infinite 51 antichain. This result is optimal and has connections to the program of reverse mathematics.
منابع مشابه
On computable self-embeddings of computable linear orderings
Wemake progress toward solving a long-standing open problem in the area of computable linear orderings by showing that every computable η-like linear ordering without an infinite strongly η-like interval has a computable copy without nontrivial computable self-embedding. The precise characterization of those computable linear orderings which have computable copies without nontrivial computable ...
متن کاملIterated effective embeddings of abelian p-groups
The paper contributes to the theory of recursively presented (see Higman [22]) infinitely generated abelian groups with solvable word problem. Mal’cev [35] and independently Rabin [39] initiated the study of such groups in the early 1960’s. In the paper we develop a technique that we call iterated effective embeddings. The significance of our new technique is that it extends the iteration techn...
متن کاملOn Computable Field Embeddings and Difference Closed Fields
We investigate when a computable automorphism of a computable field can be effectively extended to a computable automorphism of its (computable) algebraic closure. We then apply our results and techniques to study effective embeddings of computable difference fields into computable difference closed fields.
متن کاملEmbeddings of Computable Structures
We study what the existence of a classical embedding between computable structures implies about the existence of computable embeddings. In particular, we consider the effect of fixing and varying the computable presentations of the computable structures.
متن کاملOn self-embeddings of computable linear orderings
The Dushnik–Miller Theorem states that every infinite countable linear ordering has a nontrivial self-embedding. We examine computability-theoretical aspects of this classical theorem.
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
عنوان ژورنال:
- Notre Dame Journal of Formal Logic
دوره 49 شماره
صفحات -
تاریخ انتشار 2008